Repeated-Root Self-Dual Negacyclic Codes over Finite Fields
نویسنده
چکیده
Let Fq be a finite field with q = p , where p is an odd prime. In this paper, we study the repeated-root self-dual negacyclic codes over Fq. The enumeration of such codes is investigated. We obtain all the self-dual negacyclic codes of length 2p over Fq, a ≥ 1. The construction of self-dual negacyclic codes of length 2bp over Fq is also provided, where gcd(2, b) = gcd(b, p) = 1 and a ≥ 1.
منابع مشابه
On Repeated-Root Constacyclic Codes of Length $2^amp^r$ over Finite Fields
In this paper we investigate the structure of repeated root constacyclic codes of length 2mp over Fps with a ≥ 1 and (m, p) = 1. We characterize the codes in terms of their generator polynomials. This provides simple conditions on the existence of self-dual negacyclic codes. Further, we gave cases where the constacyclic codes are equivalent to cyclic codes.
متن کاملSome Generalizations of Good Integers and Their Applications in the Study of Self-Dual Negacyclic Codes
Good integers introduced in 1997 form an interesting family of integers that has been continuously studied due to their rich number theoretical properties and wide applications. In this paper, we have focused on classes of 2β-good integers, 2β-oddlygood integers, and 2β-evenly-good integers which are generalizations of good integers. Properties of such integers have been given as well as their ...
متن کاملRepeated-root cyclic and negacyclic codes over a nite chain ring
We show that repeated-root cyclic codes over a finite chain ring are in general not principally generated. Repeated-root negacyclic codes are principally generated if the ring is a Galois ring with characteristic a power of 2. For any other finite chain ring they are in general not principally generated. We also prove results on the structure, cardinality and Hamming distance of repeated-root c...
متن کاملRepeated-root cyclic and negacyclic codes over a finite chain ring
We show that repeated-root cyclic codes over a finite chain ring are in general not principally generated. Repeated-root negacyclic codes are principally generated if the ring is a Galois ring with characteristic a power of 2. For any other finite chain ring they are in general not principally generated. We also prove results on the structure, cardinality and Hamming distance of repeated-root c...
متن کاملSIMPLE-ROOT NEGACYCLIC CODES OF LENGTH 2pl OVER A FINITE FIELD
Let p, l be distinct odd primes, q be an odd prime power with gcd(q, p) = gcd(q, l) = 1, and m, n be positive integers. In this paper, we determine all self-dual, self-orthogonal and complementarydual negacyclic codes of length 2pl over the finite field Fq with q elements. We also illustrate our results with some examples.
متن کامل